#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define FOR(i, x, y) for (decay<decltype(y)>::type i = (x), _##i = (y); i < _##i; ++i)
#define FORD(i, x, y) for (decay<decltype(x)>::type i = (x), _##i = (y); i > _##i; --i)
#ifdef zerol
#define dbg(x...) do { cout << "\033[32;1m" << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cout << v << ' '; err(x...); }
template<typename T, typename... A>
void err(T a, A... x) { cout << a << ' '; err(x...); }
#else
#define dbg(...)
#endif

default_random_engine dre(time(0));

LL bin(LL x, LL n, LL MOD) {
    LL ret = MOD != 1;
    for (x %= MOD; n; n >>= 1, x = x * x % MOD)
        if (n & 1) ret = ret * x % MOD;
    return ret;
}
inline LL get_inv(LL x, LL p) { return bin(x, p - 2, p); }

LL mul(LL a, LL b, LL m) {
    LL ret = 0;
    while (b) {
        if (b & 1) {
            ret += a;
            if (ret >= m) ret -= m;
        }
        a += a;
        if (a >= m) a -= m;
        b >>= 1;
    }
    return ret;
}

bool checkQ(LL a, LL n) {
    if (n == 2 || a >= n) return 1;
    if (n == 1 || !(n & 1)) return 0;
    LL d = n - 1;
    while (!(d & 1)) d >>= 1;
    LL t = bin(a, d, n);  // 不一定需要快速乘
    while (d != n - 1 && t != 1 && t != n - 1) {
        t = mul(t, t, n);
        d <<= 1;
    }
    return t == n - 1 || d & 1;
}

bool primeQ(LL n) {
    static vector<LL> t = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};
    if (n <= 1) return false;
    for (LL k: t) if (!checkQ(k, n)) return false;
    return true;
}

template<typename T>
T randint(T l, T r) {
    uniform_int_distribution<T> u(l, r);
    return u(dre);
}

template<typename T>
T randprime(T l, T r) {
    LL x;
    for (x=randint(l, r); !primeQ(x); x = randint(l, r));
    return x;
}

template<typename T>
void print(vector<T> v) {
    int siz = v.size();
    for (int i=0; i<siz-1; ++i)
        cout << v[i] << ' ';
    cout << v[siz-1] << endl;
}

template<typename T>
void print(T v[], int siz) {
    for (int i=0; i<siz-1; ++i)
        cout << v[i] << ' ';
    cout << v[siz-1] << endl;
}

void print(vector<LL> v) {
    int siz = v.size();
    for (int i=0; i<siz-1; ++i)
        cout << v[i] << ' ';
    cout << v[siz-1] << endl;
}

int main() {
    int t = 10;
    cout << t << endl;
    int MAXV = 1000000000;
    for (int kk=0; kk<t; ++kk) {
        print({68918851, MAXV, MAXV});
    }

    
    return 0;
}